Cyclic 2-(91, 6, 1) designs with multiplier automorphisms
نویسندگان
چکیده
منابع مشابه
Steiner 2-designs S(2, 4, 28) with Nontrivial Automorphisms
In this article designs with parameters S(2, 4, 28) and nontrivial automorphism groups are classified. A total of 4466 designs were found. Together with some S(2, 4, 28)’s with trivial automorphism groups found by A.Betten, D.Betten and V.D.Tonchev this sums up to 4653 nonisomorphic S(2, 4, 28) designs.
متن کامل1 9 M ay 2 00 6 DEGENERATE REAL HYPERSURFACES IN C 2 WITH FEW AUTOMORPHISMS
We introduce new biholomorphic invariants for real-analytic hypersurfaces in C and show how they can be used to show that a hypersurface possesses few automorphisms. We give conditions, in terms of the new invariants, guaranteeing that the stability group is finite, and give (sharp) bounds on the cardinality of the stability group in this case. We also give a sufficient condition for the stabil...
متن کاملFlexible Composite Galois Field GF((2^m)^2) Multiplier Designs
Composite Galois Field GF ((2)) multiplications denote the multiplication with extension field over the ground field GF (2), that are used in cryptography and error correcting codes. In this paper, composite versatile and vector GF ((2)) multipliers are proposed. The proposed versatile GF ((2)) multiplier design is used to perform the GF ((2)) multiplication, where 2 ≤ x ≤ m. The proposed vecto...
متن کاملProduct constructions for cyclic block designs II. Steiner 2-designs
In [4] we introduced a product construction for cyclic Steiner quadruple systems. The purpose of this paper is to modify the construction so that it is applicable to cyclic Steiner 2-designs. A cyclic Steiner 2-design is a Steiner system s(t, k, u), 2 d t < k < u, in which t = 2 and which has an automorphism of order u. We denote such a system by CS(2, k, u). Under suitable conditions we show h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90442-5